Self-Dual Cyclic and Quantum Codes Over Z2^{\alpha} x (Z2 + uZ2)^{\beta}
نویسندگان
چکیده
In this paper we introduce self-dual cyclic and quantum codes over Zα2 × (Z2 + uZ2) . We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C. Since the binary image of a selforthogonal Z2Z2[u]-linear code is also a self-orthogonal binary linear code, we introduce quantum codes over Zα2 × (Z2 + uZ2) β . Finally, we present some examples of self-dual cyclic and quantum codes that have good parameters.
منابع مشابه
Self-Dual Codes over $\mathbb{Z}_2\times (\mathbb{Z}_2+u\mathbb{Z}_2)$
In this paper, we study self-dual codes over Z2× (Z2+uZ2), where u 2 = 0. Three types of self-dual codes are defined. For each type, the possible values α, β such that there exists a code C ⊆ Z2×(Z2+uZ2) β are established. We also present several approaches to construct self-dual codes over Z2 × (Z2 + uZ2). Moreover, the structure of two-weight self-dual codes is completely obtained for α · β 6...
متن کاملThe Structure of One Weight Linear and Cyclic Codes Over Z2^r x (Z2+uZ2)^s
Inspired by the Z2Z4-additive codes, linear codes over Z r 2×(Z2 + uZ2) s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Zr2×(Z2 + uZ2) s have some advantages compared to Z2Z4-additive codes. A code is called constant weight(one weight) if all the codewords have the same weight. It is well known that constant wei...
متن کاملInternational Journal of Mathematics And its Applications On Covering Radius of Codes Over R = Z 2 + u Z 2 , where u 2 = 0 Using Bachoc Distance
In this paper, we give lower and upper bounds on the covering radius of codes over the ring R = Z2 + uZ2, where u2 = 0 with bachoc distance and also obtain the covering radius of various Repetition codes, Simplex codes of α-Type code and β-Type code. We give bounds on the covering radius for MacDonald codes of both types over R = Z2 + uZ2. MSC: 20C05, 20C07, 94A05, 94A24.
متن کاملZ2Z4-additive cyclic codes, generator polynomials and dual codes
A Z2Z4-additive code C ⊆ Z2 ×Zβ4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. These codes can be identified as submodules of the Z4[x]-module Z2[x]/(x− 1)×Z4[x]/(x − 1). The parameters of a Z2Z4-additive cyclic code are stated i...
متن کاملOn $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-$(1+u)$-additive constacyclic
In this paper, we study Z2Z2[u]-(1 + u)-additive constacyclic code of arbitrary length. Firstly, we study the algebraic structure of this family of codes and a set of generator polynomials for this family as a (Z2+uZ2)[x]-submodule of the ring Rα,β. Secondly, we give the minimal generating sets of this family codes, and we determine the relationship of generators between the Z2Z2[u]-(1 + u)-add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017